Greedy-like algorithms for the cosparse analysis model
نویسندگان
چکیده
Article history: Received 6 July 2012 Accepted 5 March 2013 Available online xxxx Submitted by V. Mehrmann AMS classification: 94A20 94A12 62H12
منابع مشابه
Greedy Algorithm for the Analysis Transform Domain
Many signal and image processing applications have benefited remarkably from the theory of sparse representations. In the classical synthesis model, the signal is assumed to have a sparse representation under a given known dictionary. The algorithms developed for this framework mainly operate in the representation domain. Recently, a new model has been introduced, the cosparse analysis one, in ...
متن کاملA greedy algorithm for the analysis transform domain
Many signal and image processing applications have benefited remarkably from the theory of sparse representations. In the classical synthesis model, the signal is assumed to have a sparse representation under a given known dictionary. The algorithms developed for this framework mainly operate in the representation domain. Recently, a new model has been introduced, the cosparse analysis one, in ...
متن کاملThe Approximation Power of Priority Algorithms by Spyros Angelopoulos
The Approximation Power of Priority Algorithms Spyros Angelopoulos Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Greedy-like algorithms have been a popular approach in combinatorial optimization, due to their conceptual simplicity and amenability to analysis. Surprisingly, it was only recently that a formal framework for their study emerged. In particul...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملOrder-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for abstracting the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] extended it so as to make it applicable to graph optimization problems. In this paper we propose a related model which places certain reasonable restrictions on the power of the greedy-like algorithm. Our goal is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013